Meeting Pearls 1/Meeting Pearls Vol 1 (1994).iso/installed_progs/text/faqs/ai-faq.general.part6

Internet Message Format | 1994-05-15 | 64.3 KB

Subject: FAQ: Artificial Intelligence FTP Resources 6/6 [Monthly posting]
Newsgroups: comp.ai,news.answers,comp.answers
From: [e-mail] (Mark Kantrowitz)
Date: Fri, 13 May 1994 14:54:46 GMT

Archive-name: ai-faq/general/part6
Last-Modified: Tue Apr 12 22:06:26 1994 by Mark Kantrowitz
Version: 1.18

;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Mark Kantrowitz
;;; ai_6.faq -- 62647 bytes

If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to [e-mail].

Please note that the FTP Resources are now split across parts 5 and 6
of the AI FAQ.

Note: Question [5-2] is split across parts 5 and 6.

Part 6 (FTP Resources):
  [5-2b] FTP and Other Resources: Qualitative Reasoning -- Theorem Proving
  [6-1]  AI Bibliographies available by FTP
  [6-2]  AI Technical Reports available by FTP
  [6-3]  Where can I get a machine readable dictionary, thesaurus, and
         other text corpora?
  [6-4]  List of Smalltalk implementations.
  [6-5]  AI-related CD-ROMs
  [6-6]  World-Wide Web (WWW) Resources

Search for [#] to get to question number # quickly.

----------------------------------------------------------------
Subject: [5-2b] FTP and Other Resources: Qualitative Reasoning --
                Theorem Proving

Qualitative Reasoning/Qualitative Physics:

   QSIM     -- cs.utexas.edu:/pub/qsim
               Contact: Ben Kuipers <[e-mail]>

   QPE      -- multivac.ils.nwu.edu:/pub/QPE
               contact: Prof. Kenneth D. Forbus <[e-mail]>
               Qualitative Process Engine (an implementation of QP theory)

Robotics (Planning Testbeds and Simulators):

   See Steve hanks, Martha E. Pollack, and Paul R. Cohen, "Benchmarks,
   Test Beds, Controlled Experimentation, and the Design of Agent
   Architectures", AI Magazine 14(4):17-42, Winter 1993.

   TILEWORLD -- cs.washington.edu:/new-tileworld.tar.Z
               Planning testbed

   The ARS MAGNA abstract robot simular provides an abstract world in
   which a planner controls a mobile robot. This abstract world is more
   realistic than typical blocks worlds, in which micro-world simplifying
   assumptions do not hold. Experiments may be controlled by varying
   global world parameters, such as perceptual noise, as well as building
   specific environments in order to exercise particular planner
   features. The world is also extensible to allow new experimental
   designs that were not thought of originally. The simulator also
   includes a simple graphical user-interface which uses the CLX
   interface to the X window system. ARS MAGNA can be obtained by
   anonymous ftp from
      ftp.cs.yale.edu:/pub/nisp
   as the file ars-magna.tar.Z. Installation instructions are in the file
   Installation.readme. The simulator is written in Nisp, a macro-package
   for Common Lisp. Nisp can be retrieved in the same way as the
   simulator. Version 1.0 of the ARS MAGNA simulator is documented in
   Yale Technical Report YALEU/DCS/RR #928, "ARS MAGNA: The Abstract
   Robot Simulator". This report is available in the distribution as a
   PostScript file. Comments should be directed to Sean Philip
   Engelson <[e-mail]>.

   Simderella is a robot simulator consisting of three programs: CONNEL
   (the controller), SIMMEL (the robot simulator), and BEMMEL (the
   X-windows oriented graphics back-end). SIMMEL performs a few matrix
   multiplications, based on the Denavit Hartenberg method, calculates
   velocities with the Newton-Euler scheme, and communicates with the
   other two programs.  BEMMEL only displays the robot.  CONNEL is the
   controller, which must be designed by the user (in the distributed
   version, CONNEL is a simple inverse kinematics routine.)  The programs
   use Unix sockets for communication, so you must have sockets, but you
   can run the programs on different machines.  The software is available
   by anonymous ftp from
      galba.mbfys.kun.nl:/pub/neuro-software/pd/ [131.174.82.73]
   as the file simderella.2.0.tar.gz. The software has been compiled using
   gcc on SunOS running under X11R4/5 on Sun3, Sun4, Sun Sparc 1, 2, and
   10, DEC Alpha, HP700, 386/486 (Linux), and Silicon Graphics
   architectures. For more information, send email to Patrick van der
   Smagt, <[e-mail]>.

   The Michigan Intelligent Coordination Experiment (MICE) testbed is a
   tool for experimenting with coordination between intelligent systems
   under a variety of conditions.  MICE simulates a two-dimensional
   grid-world in which agents may move, communicate, and affect their
   environment.  MICE is essentially a discrete-event simulator that
   helps control the domain and a graphical representation, but provides
   relatively few constraints on the form of the domain and the agents'
   abilities.  Users may specify the time required by various activities,
   the constraints on an agents' sensors, the configuration of the domain
   and its properties, etc.  MICE runs under XWindows on Un*x boxes, on
   Macs, and on TI Explorers, with relatively consistent graphical
   displays.  Source code, documentation, and examples are available via
   anonymous ftp to ftp.eecs.umich.edu:/software/Mice/Mice.tar.Z.  MICE was
   produced by the University of Michigan's Distributed Intelligent Agent
   Group (UM DIAG).  For further information, write to
   [e-mail].

   A mobile robot simulator and controller by [e-mail] is
   available by anonymous ftp from
      ftp.ai.sri.com:pub/konolige/erratic-ver1.tar.Z

   A SGI-based simulator from the University of Melbourne, with very
   nice graphics, is available by anonymous ftp from
      krang.vis.citri.edu.au:/pub/robot
   Write to [e-mail] for more information.

Search:

   AISEARCH is a C++ class library for search algorithms implemented by
   Peter Bouthoorn <[e-mail]>. It includes implementations of
   DFS, BFS, uniform cost, best-first, bidirectional DFS/BFS, and AND/OR
   DFS/BFS search algorithms. It is available by anonymous ftp from
   obelix.icce.rug.nl:/pub/peter/ as aisearch.zip or aisearch.tar.Z.

Simulated Annealing:

   ASA (Adaptive Simulated Annealing) is a powerful global optimization
   C-code algorithm especially useful for nonlinear and/or stochastic
   systems. Most current copies can be obtained by anonymous ftp from
      ftp.alumni.caltech.edu:/pub/ingber/ASA.tar.gz [131.215.48.62]
   an uncompressed version, asa, also is in that archive.  There are several
   related (p)reprints in the Caltech archive, including sa_pvt93.ps.Z,
   "Simulated annealing: Practice versus theory." The first VFSR code was
   developed by Lester Ingber in 1987, and the reprint of that paper is
   vfsr89.ps.Z, "Very fast simulated re-annealing".  If you cannot use
   ftp or ftpmail, then copies of the code are also available by email
   from the author at [e-mail]. To be added to the
   mailing list, send mail to [e-mail].

   The VFSR code was made publicly available in 1992 under the GNU GPL, by
   Lester Ingber and Bruce Rosen.  The last version of that code before
   the introduction of ASA is available via anonymous ftp from
   ringer.cs.utsa.edu:/pub/rosen/vfsr.tar.Z.  Bruce Rosen has a comparison
   study, "Function Optimization based on Advanced Simulated Annealing,"
   which is available via anonymous ftp from
   archive.cis.ohio-state.edu:/pub/neuroprose/rosen.advsim.ps.Z.
   [VFSR is no longer supported, but ASA is. --mk]

Speech:

   RECNET is a complete speech recognition system for the DARPA TIMIT and
   Resource Management tasks.  It uses recurrent networks to estimate phone
   probabilities and Markov models to find the most probable sequence of
   phones or words.  The system is a snapshot of evolving research code.
   There is no documentation other than published research papers.  It is
   configured for the two specific databases and is unlikely to be of use as
   a complete system for other tasks. It is available by anonymous ftp from
      svr-ftp.eng.cam.ac.uk:/misc/recnet-1.3.tar.Z
   Related publications can be found in
      svr-ftp.eng.cam.ac.uk:/reports/ (see the ABSTRACT file first).
   You will need the relevant CDROMs, 150MByte of free space for TIMIT and
   300MByte for RM. If you use the code, the author would appreciate an
   email message so that he can keep you informed of new releases. Write to
   Tony Robinson, <[e-mail]>, for more information.

   CELP 3.2a is available from super.org:/pub/celp_3.2a.tar.Z
   [192.31.192.1] with copies available on
   svr-ftp.eng.cam.ac.uk:/comp.speech/sources/ The code (C, FORTRAN,
   diskio) all has been built and tested on a Sun4 under SunOS4.1.3.  If
   you want to run it somewhere else, then you may have to do a bit of
   work.  (A Solaris 2.x-compatible release is planned soon.) Written by
   Joe Campbell <[e-mail]> of the Department of
   Defense. Distribution facilitated by Craig F. Reese
   <[e-mail]>, IDA/Supercomputing Research Center.

   The OGI Speech Tools are set of speech data manipulation tools
   developed at the Center for Spoken Language Understanding (CSLU) at
   the Oregon Graduate Institute of Science and Technology (Portland
   Oregon). The tools can be used to compute and display signal
   representations, label speech at different levels (e.g., phonetic,
   phonemic and word), train neural network classifiers, and display the
   output of classification or recognition algorithms time-aligned with
   the speech. The OGI Speech Tools were written in ANSI C.  The OGI
   Speech Tools are available by anonymous ftp from
      speech.cse.ogi.edu:/pub/tools/
   as ogitools.v1.0.tar.Z. For more information, write to Johan Schalkwyk
   <[e-mail]>. If you're using the tools, please let Johan know
   by sending him a mail message.

   PC Convolution is a educational software package that graphically
   demonstrates the convolution operation.  It runs on IBM PC compatibles
   using DOS 4.0 or later. A demo version is available by anonymous ftp
   from
      ee.umr.edu:/pub/ [131.151.4.11]
   as pc_conv.*.  University instructors may obtain a free, fully
   operational version by contacting Dr. Kurt Kosbar <[e-mail]> at
   117 Electrical Engineering Building, University of Missouri/Rolla,
   Rolla, Missouri, 65401, phone [phone].


Temporal Reasoning:

   See also KNOWBEL above.

   MATS     -- Metric/Allen Time System
               Contact: Henry Kautz <[e-mail]>
               MATS is a Common Lisp program which solves temporal
               constraint problems.  Input constraints are either
               difference inequalities or Allen-style qualitative constraints.

   TMM      -- New implementation of Dean & McDermott's Temporal Map
               Manager system written in Common Lisp.
               See SIGART Bulletin 4(3), July 1993.
               Contact: [e-mail]

   MTMM     -- Modified version of Dean & McDermott's TMM written in
               MCL.  Available on diskette.
               Contact: Eckehard Gross <[e-mail]>

   TimeGraph-- Metric and Qualitative temporal reasoning system which
               handles (<, =, >) point relations, bounds on absolute
               calendar/clock times, and bounds on durations. Data entry
               and retrieval is through interval or point relations.
               The system is scalable in the sense that storage
               remains linear in the number of relations added.
               Efficient retrieval is achieved through a simple
               timepoint numbering scheme and metagraph structure.
               See SIGART Bulletin 4 (3), pp. 21-25, July 1993.
               Contact: Lenhart Schubert ([e-mail])

   TimeGraph II (TG-II) handles the set of the relations of the Point
   Algebra and of the Pointizable Interval Algebra (also called Simple
   Interval Algebra by P. van Beek). Temporal relations are represented
   through a "timegraph", a graph partitioned into a collection of "time
   chains" which are automatically structured for efficiency. The system
   is scalable, in the sense that the storage tends to remain linear in
   the number of relations asserted. Efficient query handling is achieved
   through a time point numbering scheme and a "metagraph" data
   structure. TG-II is written in Common Lisp.  For a description of the
   theory underlying the system see:
      [1] Alfonso Gerevini and Lenhart Schubert, "Efficient Temporal
      Reasoning through Timegraphs", in Proceedings of IJCAI-93.
      [2] Alfonso Gerevini and Lenhart Schubert, "Temporal Reasoning in
      TimeGraph I-II", SIGART Bulletin 4(3), July 1993.
      [3] Alfonso Gerevini and Lenhart Schubert, "Efficient Algorithms
      for Qualitative Reasoning about Time", Artificial Intelligece,
      to appear. Also available as IRST Technical Report 9307-44,
      IRST 38050 Povo, TN Italy; or Tech. report 496, Computer Science
      Department, University of Rochester, Rochester 14627 NY, USA.
   TimeGraph II is available by anonymous ftp from
      cs.rochester.edu:/pub/knowledge-tools/
   as the files tg-ii.readme and tg-ii-1.tar.gz. If you retrieve a copy
   of TimeGraph II by anonymous ftp, please let them know that you've
   retrieved a copy by sending a message to
      [e-mail]
   For more information, contact Alfonso Gerevini <[e-mail]> or
   Lenhart Schubert <[e-mail]>.

   Tachyon  -- Performs constraint satisfaction for point-based metric
               reasoning.  Qualitative constraints are also handled by
               translation into quantitative ones.  Written in C++.
               See SIGART Bulletin 4(3), July 1993.
               Contact: Richard Arthur ([e-mail])

   TimeLogic-- The TimeLogic system is an interval-based forward
               chaining inference engine and database manager of
               temporal constraints.  Relational constraints,
               indicating relative order between intervals, are based
               on Allen's interval logic.  The TimeLogic system also
               supports durational constraints, indicating relative
               magnitude between intervals, and reference links, used
               for the explicit or automatic construction of interval
               hierarchies.  Constraints are posed and propagated in
               user-defined contexts with inheritance. Supports relative
               metric constraints but no absolute dates or times.
               Written in Common Lisp.
               Contact: Peggy Meeker ([e-mail])

   TemPro   -- A temporal constraint system that uses both interval
               algebra and point-based algebra. Written in Common Lisp.
               Contact: J-P Haton <[e-mail]> or
                        F. Charpillet <[e-mail]>

   TIE      -- Temporal Inference Engine.  Written in Common Lisp.
               Contact: E. Tsang (Essex University, UK)

   TCNM (Temporal Constraint Network Manager) manages non-disjunctive
   metric constraints on time-points and on durations in an integrated
   way. These constraints allow us express absolute, qualitative and
   metric constraints on time-points and on durations, which are managed
   in an integrated way. In the updating processes, a non-redundant and
   global consistent Temporal Constraint Network is always maintained by
   means of an efficient and complete propagation method, with a O(n**2)
   temporal complexity. Sound and complete retrieval processes have a
   constant cost. Written in Common Lisp.  For more information, contact
   Federico A. Barber <[e-mail]>.  See also SIGART Bulletin
   4(3), July 1993.

Theorem Proving/Automated Reasoning:

   Otter         -- info.mcs.anl.gov:/pub/Otter/Otter-2.2/otter22.tar.Z
                    anagram.mcs.anl.gov:/pub/Otter/
                    Contact: [e-mail]
                    Resolution-based theorem prover.

   ATP Problems  -- anagram.mcs.anl.gov:/pub/ATP_Problems/*
                    Collection of ATP problems from Otter, CADE, and JAR.
                    The problems include algebra, analysis, circuits,
                    geometry, logic problems, Pelletier's problem set,
                    program verification, puzzles, set theory, and topology.

   SETHEO        -- flop.informatik.tu-muenchen.de:/pub/fki/ [131.159.8.35]
                    Get the files setheo.info and setheo.tar.Z.
                    SETHEO (SEquential THEOrem prover) is an automated
                    theorem prover for formulae of predicate logic.
                    SETHEO is based on the calculus of ``connection
                    tableaux''. SETHEO runs on Sun SPARCs only.
                    Contact: [e-mail]

   ISABELLE-93. Isabelle is a highly automated generic theorem prover
   written in Standard ML.  New logics are introduced by specifying their
   syntax and rules of inference.  Proof procedures can be expressed
   using tactics and tacticals. Isabelle comes with 8 different logics,
   including LCF, some modal logics, first-order logic, Zermelo-Fraenkel
   set theory, and higher-order logic. Isabelle-93 is not upwardly
   compatible with its predecessor, but comes with advice on converting
   to the new simplifier.  Isabelle-93 is available by anonymous ftp from
   the University of Cambridge,
      ftp.cl.cam.ac.uk:/ml/ [128.232.0.56]
   as Isabelle93.tar.gz. It is also available from the Technical
   University of Munich,
      ftp.informatik.tu-muenchen.de:/lehrstuhl/nipkow/ [131.159.0.198]
   The distribution includes extensive documentation, including a 71-page
   introduction, an 85-page reference manual, and a 166-page description of
   the various logics supplied with Isabelle. For more information, write
   to [e-mail] and [e-mail].
   An Emacs-Lisp package for Isabelle by [e-mail]
   is available from
      ftp.dcs.ed.ac.uk:/pub/da/isa-mode.tar.gz

   MVL      -- t.stanford.edu:/mvl/mvl.tar.Z
               Contact: [e-mail]
               Multi-valued logics

   Boyer-Moore -- ftp.cli.com:/pub/nqthm/nqthm.tar.Z
                  rascal.ics.utexas.edu:/pub/nqthm   128.83.138.20
   See also the pub/proof-checker/ subdirectory, which contains Matt
   Kaufmann's proof checking enhancements to nqthm.

   Nqthm-1992 is the Boyer-Moore theorem prover. The 1992 version of the
   theorem prover is upwardly compatible with the previous (1987)
   version. Included in the distribution are thousands of Nqthm-checked
   theorems formulated by Bevier, Boyer, Brock, Bronstein, Cowles,
   Flatau, Hunt, Kaufmann, Kunen, Moore, Nagayama, Russinoff, Shankar,
   Talcott, Wilding, Yu, and others. The release of Nqthm-1992 includes
   three revised chapters of the book `A Computational Logic Handbook',
   including Chapter 4, on the formal logic for which the system is a
   prover, and Chapter 12, the reference guide to user commands.  Nqthm
   runs in Common Lisp, and has been tested in AKCL, CMU CL, Allegro CL,
   Lucid CL, MCL, and Symbolics CL. Nqthm-1992 is available by anonymous
   ftp from
      ftp.cli.com:/pub/nqthm/nqthm-1992/  [192.31.85.129]
   as the file nqthm-1992.tar.Z. See the file README in the same
   directory for instructions on retrieving nqthm.  See also the
      /pub/pc-nqthm/pc-nqthm-1992/
   directory (files README-pc and pc-nqthm-1992.tar.Z), which contains
   Matt Kaufmann's interactive proof-checking enhancements to Nqthm-1992.
   For more information, contact Robert S. Boyer <[e-mail]>, J.
   Strother Moore <[e-mail]>, or Matt Kaufmann <[e-mail]>,
   Computational Logic Inc., 1717 West 6th Street, Suite 290, Austin, TX
   78703-4776.  Send mail to [e-mail] to be added to
   the mailing list.

   DTP is a general theorem prover incorporating domain-independent control
   of inference.  Implemented in CLtL2 Common Lisp, it runs in Franz
   Allegro, Lucid, and Macintosh (MCL) Common Lisp.  It is available by
   anonymous ftp from meta.stanford.edu:/pub/dtp/ [36.8.0.54].  Contact
   Don Geddis <[e-mail]> for more information.

   RRL       -- herky.cs.uiowa.edu:/public/rrl [128.255.28.100]
                Rewrite Rule Laboratory

   FRAPPS (Framework for Resolution-based Automated Proof Procedures) is
   a portable resolution theorem-prover written in Common Lisp. It is
   available via anonymous ftp from a.cs.uiuc.edu:/pub/frapps [128.174.252.1].
   If you take a copy of FRAPPS, please send a short note to Prof.
   Alan M. Frisch <[e-mail]>.

   XPNet (X Proof Net) is a graphical interface to proof nets with an
   efficient proof checker. It is available by anonymous ftp to
   ftp.cis.upenn.edu:/pub/xpnet.tar.Z [130.91.6.8]. For further
   information, write to Jawahar Chirimar <[e-mail]>,
   Carl A. Gunter <[e-mail]>, or Myra VanInwegen
   <[e-mail]>.

   Gazer is a sequent calculus based system for first order logic with a
   novel inference rule, gazing, that enables the system to determine
   which of a possibly large number of definitions and lemmas should be
   used at any point in a proof. Available from the authors, Dave
   Barker-Plummer <[e-mail]> and Alex Rothenberg
   <[e-mail]>.

   KEIM is a collection of software modules, written in Common Lisp with
   CLOS, designed to be used in the production of theorem proving
   systems.  KEIM is intended to be used by those who want to build or
   use deduction systems (such as resolution theorem provers) without
   having to write the entire framework. KEIM is also suitable for
   embedding a reasoning component into another Common Lisp program.
   KEIM offers a range of datatypes implementing a logical language of
   type theory (higher order logic), in which first order logic can be
   embedded.  KEIM's datatypes and algorithms include: types; terms
   (symbols, applications, abstractions), environments (e.g., associating
   symbols with types); unification and substitutions; proofs, including
   resolution and natural deduction style. KEIM also provides
   functionality for the pretty-printing, error handling, formula parsing
   and user interface facilities which form a large part of any theorem
   prover. Implementing with KEIM thus allows the programmer to avoid a
   great deal of drudgery.  KEIM has been tested in Allegro CL 4.1 and
   Lucid CL 4.0 on Sun 4 workstations.  KEIM is available for
   noncommercial use via anonymous FTP from
      js-sfbsun.cs.uni-sb.de:/pub/keim/keim*
   For more information contact Dan Nesmith, Fachbereich Informatik/AG
   Siekmann, Universitaet des Saarlandes, Postfach 1150, D-66041
   Saarbruecken, Germany, or send email to [e-mail].  A mailing
   list for KEIM users is also being set up.  Send mail to
   [e-mail] to be put on the list.

   The TPTP (Thousands of Problems for Theorem Provers) Problem Library
   is a collection of test problems for automated theorem provers (ATPs),
   using the clausal normal form of 1st order predicate logic.  The goal
   of the TPTP is to provide a firm basis for the testing, evaluation,
   and comparison of ATP systems through a comprehensive library of ATP
   test problems in a general purpose format. The TPTP includes tools to
   convert the problems to existing ATP formats, such as the OTTER, MGTP,
   PTTP, SETHEO, and SPRFN formats.  Each problem includes a list of
   references and other relevant information.  The TPTP also aims to
   supply general guidelines outlining the requirements for ATP system
   evaluation. The TPTP can be obtained by anonymous ftp from either the
   Department of Computer Science, James Cook University, Australia,
      coral.cs.jcu.edu.au:/pub/tptp-library            [137.219.17.4]
   or the Institut fuer Informatik, TU Muenchen, Germany,
      flop.informatik.tu-muenchen.de:/pub/tptp-library [131.159.8.35]
   as the files ReadMe (general information about the library),
        TPTP-v1.1.0.tar.gz (the library itself), and
        TR-v1.0.0.ps.gz (a postscript technical report about the TPTP).
   Additions and corrections may be sent to Geoff Sutcliffe
   <[e-mail]> (Fax: [phone]) or Christian Suttner
   <[e-mail]> (Fax: [phone]).  If you
   would like to be kept informed of new versions of the TPTP, please
   send email to either of them.

   See SEQUEL entry in the Lisp FAQ, part 6.

   Elf implements the LF Logical Framework (based on the theory of
   dependent types) and gives it a logic programming interpretation in
   order to support search and the implementation of other algorithms (e.g.
   evaluation or compilation in programming languages).  It comes with a
   number of examples from logic and the theory of programming languages
   such as the Church Rosser theorem for the untyped lambda-calculus and
   type soundness for Mini-ML.  It is written in Standard ML and includes
   some support code for editing and interaction in gnu-emacs. It is
   available by anonymous ftp from
      ftp.cs.cmu.edu:/afs/cs/user/fp/public/
   as the files README (general information), elf-04.tar.Z (Version 0.4
   of Elf, 1 Jul 1993), elf-examples.tar.Z (Version 0.4 of Elf examples,
   unchanged from Version 0.3), and elf-papers/ (DVI files for papers
   related to LF and Elf, including a "tutorial" and a bibliography). For
   more information, contact Frank Pfenning <[e-mail]>,
   Department of Computer Science, Carnegie Mellon University.

   The Nuprl Proof Development System is available by anonymous ftp
   from ftp.cs.cornell.edu:/pub/n/. Nuprl should run in any Common
   Lisp with CLX. There are also (obsolete) interfaces for Symbolics Lisp
   machines and Suns running the SunView window system. Nuprl has been
   tested with Allegro, Lucid, AKCL. For further information, contact
   Elizabeth Maxwell, <[e-mail]>, Nuprl Distribution
   Coordinator, Department of Computer Science, Upson Hall, Cornell
   University, Ithaca, NY 14853.

   Coq is the Calculus of Inductive Constructions. It runs in
   Caml-Light and is available by anonymous ftp from
      ftp.inria.fr:/INRIA/coq/V5.8.3 (unix version)
      ftp.inria.fr:/INRIA/coq/V5.8.2 (mac version)
   The Mac version is standalone, not requiring Caml-Light. The unix
   version requires Caml-Light, however, which is available from
      ftp.inria.fr:/lang/caml-light
   Documentation is included in the distribution. Questions and comments
   should be directed to the Coq hotline <[e-mail]>.

Truth Maintenance:

   The truth maintenance system and problem solver implementations
   described in the book "Building Problem Solvers" by Ken Forbus and
   Johan de Kleer are available by anonymous ftp from
          multivac.ils.nwu.edu:/pub/BPS/
    parcftp.xerox.com:/pub/bps/
   For more information send mail to Johan de Kleer <[e-mail]>.
   Send bug reports to [e-mail].

Miscellaneous:

   University of Toronto:
      ftp   -- ftp.cs.toronto.edu:/pub/ailist

      Archives of ailist mailing list, defunct as of January 19, 1990

   PAIL (Portable AI Lab)
      ftp   -- pobox.cscs.ch:/pub/ai/pail-2.2/  [148.187.10.13]
      contact: [e-mail]
      authors: Mike Rosner <[e-mail]>
               Dean Allemang <[e-mail]>

----------------------------------------------------------------
Subject: [6-1] AI Bibliographies available by FTP

The Computer Science Department at the University of Saarbruecken, Germany,
maintains a large bibliographic database of articles pertaining to the
field of Artificial Intelligence. Currently the database contains more
than 25,000 references, which can be retrieved by electronic mail from
the LIDO mailserver at [e-mail]. Send a mail message with
subject line "lidosearch help info" to get instructions on using the
mail server. A variety of queries based on author names, title and
year of publication are possible. The references can be provided in
BibTeX or Refer formats. The entire bibliographic database can be
obtained for a fee by ftp or on tape. Questions may be directed to
[e-mail].

A variety of AI-related bibliographies are available by anonymous ftp
from
   nexus.yorku.ca:/pub/bibliographies/

For information on a fairly complete bibliography of computational
linguistics and natural language processing work from the 1980s, send
mail to [e-mail] with the subject HELP.

The CSLI linguistics bibliography contains 3,300 entries in
bib/tib/refer format. The bibliography is heavily slanted towards
phonetics and phonology but also includes a fair amount of
computational morphology, syntax, semantics, and psycholinguistics.
The bibliography can be used with James Alexander's tib
bibliography system, which is available from minos.inria.fr
[128.93.39.5] among other places. The bibliography itself is available
by anonymous ftp from
   csli.stanford.edu:/pub/bibliography/
Contributions are welcome, but should be in tib format.
For more information, contact Andras Kornai <[e-mail]>

Stanford University (SUMEX-AIM) has a large BibTeX bibliography of
Artificial Intelligence papers and technical reports. Available by
anonymous ftp from aim.stanford.edu:/pub/ai{1,2,3}.bib

A BibTeX database of references addressing neuro-fuzzy issues can be
obtained by anonymous ftp from
   ftp.tu-bs.de:/local/papers/ [134.169.34.15]
as the (ascii) file fuzzy-nn.bib.

Robert Dale's Natural Language Generation (NLG) bibliography is
available by anonymous ftp from
   scott.cogsci.ed.ac.uk:/pub/nlg/ [129.215.144.3]
Note that it is formatted for A4 paper. Stick in a line
   .94 .94 scale
after the %! line to print on 8.5 x 11 paper. For further information,
write to Robert Dale, University of Edinburgh, Centre for Cognitive
Science, 2 Buccleuch Place, Edinburgh EH8 9LW Scotland, or
<[e-mail]>.

Mark Kantrowitz's Natural Language Generation (NLG) bibliography is
available by anonymous ftp from
   ftp.cs.cmu.edu:/user/ai/areas/nlp/nlg/bibs/mk/ [128.2.206.173]
In addition to the tech report, the BibTeX file containing the
bibliography is also available.  The bibliography contains more than
1,200 entries. Additions and corrections should be sent to
[e-mail].

A bibliography of over 400 Evolutionary Computation references (GA,
ES, EP, GP) is available by anonymous ftp from
   magenta.me.fau.edu:/pub/ep-list/bib/
The file EC-ref.bib.Z is in BibTeX format; EC-ref.ps.Z is a postscript
version of the bibliography. Please send additions and corrections to
[e-mail] or [e-mail].

A bibliography of over 1000 entries about Self-Organizing Map
(SOM) and Learning vector Quantization (LVQ) studies is
available by anonymous ftp from
   cochlea.hut.fi:/pub/ref/
as the files references.bib.Z (BibTeX file) and references.ps.Z
(PostScript file). Please send additions and corrections to
[e-mail].

A BibTeX bibliography for Constraint Logic Programming is available
by anonymous ftp from
   archive.cis.ohio-state.edu:/pub/clp/
in the bib/ and papers/ subdirectories.

An extensive collection of references on Principal Component Analysis
(PCA) neural networks and learning algorithms is available by
anonymous ftp from dendrite.hut.fi:/pub/ref/ in LaTeX and PostScript
formats. The list was compiled by Liu-Yue Wang, a graduate student of
Erkki Oja, and updated by Juha Karhunen, all from Helsinki University
of Technology, Finland.  For more information, contact Erkki Oja
<[e-mail]>.

A bibliography of PCA algorithms is available by anonymous ftp from
ftp.ai.mit.edu:/pub/sanger-papers/ as pca.bib. For more information,
contact Terry Sanger <[e-mail]>.

A bibliography on belief revision and nonmonotonic logics with
about 2,000 items is available by anonymous ftp from
   tarski.phil.indiana.edu:/pub/morado/  [129.79.134.34]
as nonmono.bib or nonmono.bib.Z. The file is also available by WAIS as
   wais://tarski.phil.indiana.edu/nonmono.bib?
and by gopher/WWW. Please send additions and corrections to Raymundo
Morado <[e-mail]>.

A large collection of BibTeX bibliographies on a variety of subjects,
including artificial intelligence, neural networks, and
object-oriented programming, is available by anonymous ftp from
   ftp.ira.uka.de:/pub/bibliography/
and in the mirror sites
   faui80.informatik.uni-erlangen.de:/pub/literatur/Mirror/bibliography/
   ftp.cs.umanitoba.ca:/pub/bibliographies/
or by WWW from
   ftp://ftp.ira.uka.de/pub/bibliography/www/bibliography.html
Some of the bibliographies prohibit commercial use. For more
information, see the README file, or write to Alf-Christian Achilles
<[e-mail]> or <[e-mail]>.

A bibliography of papers on Silicon Auditory Models (VLSI
implementations of auditory representations) is available by anonymous
ftp from
   hobiecat.pcmp.caltech.edu:/pub/anaprose/lazzaro/sa-biblio.ps.Z
For more information, write to John Lazzaro <[e-mail]>

----------------------------------------------------------------
Subject: [6-2] Technical Reports available by FTP

This section lists the anonymous ftp sites for technical reports from
several universities and other organizations. Some of the sites
provide only an online catalog of technical reports, while the rest
make the actual reports available online. The email address listed is
that of the appropriate person to contact with questions about
ordering technical reports.

When ftping compressed .Z files, remember to set the transfer type to
binary first, using the command
        ftp> binary

Other general locations for technical reports from several
universities include:
   wuarchive.wustl.edu:/doc/techreports/ [128.252.135.4]
   cs-archive.uwaterloo.edu:/cs-archive/  (see Index for an index)
      AKA watdragon.uwaterloo.ca [129.97.140.24]
The uwaterloo archive includes tech reports from the Logic Programming
and Artificial Intelligence Group (LPAIG) of the University of Waterloo.

There is also a WAIS server containing tech report abstracts that can be
searched. To use, create the file ~/wais-sources/cs-techreport-abstracts.src
containing
   (:source
      :version  3
      :ip-address "130.194.74.201"
      :ip-name "daneel.rdt.monash.edu.au"
      :tcp-port 210
      :database-name "cs-techreport-abstracts"
      :cost 0.00
      :cost-unit :free
      :maintainer "[e-mail]")
and invoke your local wais client. To add to it, email abstracts of
your papers to [e-mail] in the following format:
   %TI Title
   %AU Author (use multiple %AU lines for multiple authors)
   %PU Published In (citation information)
   %AV Availability (e.g., ftp reports.adm.cs.cmu.edu:/1992/CMU-CS-92-101.ps)
   %OR Organization (see cs-techreport-archives.src for institution codes)
   %LT Local title (e.g., tech report number)
   %DA Date (and, if you want, %MN Month, %YR Year)
   %AB Abstract
If your papers are not available by FTP, you can use a %AV line such as:
   %AV mail [e-mail]
Further instructions are available from
   daneel.rdt.monash.edu.au:/pub/techreports/reports/README
[Based on a post by Ashwin Ram.]

Also see the Unified Computer Science Technical Report Index
    http://cs.indiana.edu/cstr/search
A list of FTP sites for technical reports and papers can be found in
    http://www.vifp.monash.edu.au/techreports/sitelist.html

A list of more than 230 sites publishing CS tech reports may be
obtained by anonymous ftp from
    ftp.rdt.monash.edu.au:/pub/techreports/sites/sites-list-data
To receive notification of new tech report sites, send mail to
[e-mail] to join the mailing list.

An archive of linguistics papers and preprints is available from
linguistics.archive.umich.edu:/linguistics/papers/. Contact John Lawler
([e-mail]) or [e-mail] for more
information.

The Concurrent Engineering Research Center (CERC) at West Virginia
University has placed ASCII versions of the concurrent
engineering-related abstracts (over 500) that were on CERCnet, ASCII
back issues of the Concurrent Engineering Research in Review journal
(now discontinued), and Postscript copies of CERC technical reports in
the gopher server gopher.cerc.wvu.edu.  In addition, many of the CERC
technical reports, including journal articles, symposium papers,
theses, dissertations, and issues of the Concurrent Engineering
Research in Review journal, are available as Postscript versions via
anonymous ftp from
   babcock.cerc.wvu.edu:/pub/techReports/ [157.182.44.36]
An index to all the reports, including some that are
available only in hardcopy, is contained in the file "CERC-TR-INDEX".
If you need additional information, contact Mary Carriger, CERC Office
of Information Services, at [e-mail].

The newsgroup comp.doc.techreports is devoted to distributing lists of
tech reports and their abstracts.

   MIT Artificial Intelligence Laboratory:
      ftp   -- publications.ai.mit.edu:/ai-publications/
      email -- [e-mail]
      browse -- telnet reading-room.lcs.mit.edu

      A full catalog of MIT AI Lab technical reports (and a listing of recent
      updates) may be obtained from the above location, by writing to
      Publications, Room NE43-818, M.I.T. Artificial Intelligence Laboratory,
      545 Technology Square, Cambridge, MA 02139, USA, or by calling
      1-617-253-6773. The catalog lists the technical reports ("AI Memos")
      with a short abstract and their current prices. There is also a charge
      for shipping. Some recent tech reports (since 1991) are available in the
      ai-publications/ subdirectory; older technical reports are NOT
      available by ftp. A bibliography is in the bibliography/ directory.

      Sandiway Fong's 1991 PhD thesis, ``The Computational Properties of
      Principle-Based Grammatical Theories,'' may be found in the
      directory pub/sandiway/.

   CMU School of Computer Science:
      ftp   -- reports.adm.cs.cmu.edu
      email -- [e-mail]

   CMU Software Engineering Institute:
      ftp   --  ftp.sei.cmu.edu:/pub/documents
      email --  [e-mail]

   Yale:
      ftp   --  dept.cs.yale.edu:/pub/TR/

   University of Washington CSE Tech Reports:
      ftp   --  june.cs.washington.edu:/tr
      email --  [e-mail]

   ================

   AT&T Bell Laboratories:
      ftp   -- netlib.att.com:/netlib/research/cstr/
      bib.Z contains short bibliography, including all the technical
      reports contained in this directory.

      ftp   -- research.att.com:/dist/ai

   Argonne National Laboratory:
      ftp   -- anagram.mcs.anl.gov:/pub/tech_reports
      email -- [e-mail]

      Contains MCS Division preprints and technical memoranda,
      available as either .dvi or .ps files. For descriptions of the
      contents, see the subdirectory pub/tech_reports/abstracts; for
      the files themselves see the subdirectory pub/tech_reports/reports.

   Boston University:
      ftp   --  cs.bu.edu:/techreports/
      email --  [e-mail]

   Brown University:
      ftp   --  wilma.cs.brown.edu:/techreports/
      email --  [e-mail]

   Cambridge University: Speech, Vision & Robotics Group
      ftp   --  svr-ftp.eng.cam.ac.uk:/reports/

   Columbia University:
      ftp   --  cs.columbia.edu:/pub/reports
      email --  [e-mail]

   DEC Cambridge Research Lab:
      ftp   --  crl.dec.com:/pub/DEC/CRL/abstracts/
        crl.dec.com:/pub/DEC/CRL/tech-reports/

   DEC Paris Research Lab:
      email --  [e-mail]
                Put commands in Subject: line of the message.
                To get a list of articles, use
                        send index articles
                To get a list of tech reports, use
                        send index reports

   DEC WRL:
      email -- [e-mail]
               To get a helpfile, send a message with
                  help
           in the subject line.

   DFKI:
      ftp   -- duck.dfki.uni-sb.de:/pub/papers
      email -- Martin Henz ([e-mail])

   Duke University:
      ftp   --  cs.duke.edu:/dist/papers/
        cs.duke.edu:/dist/theses/
      email --  [e-mail]  [unknown user, 7/7/93]

   Edinburgh:
      A list of available reports can be sent via email. Send requests
      for information about reports from the Center for Cognitive Science
      to [e-mail], and from the Human Communication
      Research Center to [e-mail].

   Electrotechnical Laboratory, Japan:
      Reports from the Cooperative Architecture project (half AI, half
      software engineering).
      ftp   -- etlport.etl.go.jp:/pub/kyocho/Papers [192.31.197.99]
               See file Index.English.
      email -- Hideyuki Nakashima <[e-mail]>.

   Georgia Tech College of Computing, AI Group:
      ftp   -- ftp.cc.gatech.edu:/pub/ai (130.207.3.245)
      email -- Professor Ashwin Ram <[e-mail]>

   HCRC (Human Communication Research Centre):
      ftp   -- scott.cogsci.ed.ac.uk:/pub/HCRC-papers/
      mail  -- Fiona-Anne Malcolm
               Human Communication Research Centre
               2 Buccleuch Place, Edinburgh, UK

   Illinois:
      email -- Erna Amerman <[e-mail]>

   Illinois Genetic Algorithms Laboratory (IlliGAL):
      email -- Eric Thompson <[e-mail]>
      phone -- 217-333-2346 (9AM to 5PM CT, M-F)
      mail  -- Illinois Genetic Algorithms Laboratory
               Department of General Engineering
               117 Transportation Building
               104 South Mathews Avenue
               Urbana, IL 61801-2996
      ftp   -- gal4.ge.uiuc.edu:/pub/papers/IlliGALs/
               Includes the GA bibliography and the Messy GA code in C
               (in /pub/src/).

   Indiana:
      ftp   -- cogsci.indiana.edu:/pub         [129.79.238.12]
      ftp   -- cs.indiana.edu:/pub/techreports [129.79.254.191]

   INRIA, France:
      ftp   -- ftp.inria.fr:/INRIA/publication/

   Institute for Learning Sciences at Northwestern University:
      ftp   --  aristotle.ils.nwu.edu:/pub/papers/
      phone --  708-491-3500

   Mechanized Reasoning Group (MRG):
      ftp   --  ftp.mrg.dist.unige.it:/pub/mrg-ftp
      email --  Fausto Giunchiglia <[e-mail]>
                Mechanized Reasoning Group, IRST
                38050 Povo Trento, Italy
                Tel: [phone] (secr.)
                     [phone] (office)
                Fax: [phone] / 314591

   National University of Singapore:
      ftp   -- ftp.nus.sg:/pub/NUS/ISCS/techreports

   New York University (NYU):
      ftp   --  cs.nyu.edu:/pub/tech-reports

   OGI:
      ftp   --  cse.ogi.edu:/pub/tech-reports
      email --  [e-mail]

   Ohio State University, Laboratory for AI Research
      ftp   -- nervous.cis.ohio-state.edu:/pub/papers
      email -- [e-mail]

   OSU Neuroprose:
      ftp   -- archive.cis.ohio-state.edu:/pub/neuroprose  (128.146.8.52)

      This directory contains technical reports as a public service to the
      connectionist and neural network scientific community which has an
      organized mailing list (for info: [e-mail])
      Includes several bibliographies.

   Stanford:
      ftp   -- elib.stanford.edu:/cs

      Very spotty collection.

   SRI:
      email -- Donna O'Neal, [e-mail]

   SUNY Buffalo:
      ftp   -- ftp.cs.buffalo.edu:/pub/tech-reports/

   SUNY at Stony Brook:
      ftp   -- sbcs.sunysb.edu:/pub/TechReports
      email -- [e-mail] or [e-mail]

      The /pub/sunysb directory contains the SB-Prolog implementation
      of the Prolog language. Contact [e-mail] for more
      information.

   TCGA (The Clearinghouse for Genetic Algorithms):
      email -- Robert Elliott Smith <[e-mail]>
               Department of Engineering of Mechanics
               Room 210 Hardaway Hall
               The University of Alabama
               PO Box 870278
               Tuscaloosa, AL 35487
               205-348-1618, fax [phone]

   Thinking Machines:
      ftp   -- ftp.think.com:/think/techreport.list

      This file contains a list of Thinking Machines technical reports.
      Orders may be placed by email (limit 5) to [e-mail], or by US
      Mail to Thinking Machines Corporation, Attn: Technical reports, 245
      First Street, Cambridge, MA 01241. In addition, the directories
      cm/starlisp and cm/starlogo contain code for the *Lisp and *Logo
      simulators.

   Tulane University:
      ftp   -- rex.cs.tulane.edu:/pub/tech/  [129.81.132.1]

   University of Arizona:
      ftp   -- cs.arizona.edu:/reports/
      email -- [e-mail]

      The directory /japan/kahaner.reports contains reports on AI in
      Japan, among other things, written by Dr. David Kahaner, a
      numerical analyst on sabbatical to the Office of Naval
      Research-Asia (ONR Asia) in Tokyo from NIST. The reports are not
      written in any sort of official capacity, but are quite interesting.

   University of California/Santa Cruz:
      ftp   -- ftp.cse.ucsc.edu:/pub/bib/
           ftp.cse.ucsc.edu:/pub/tr/
      email -- [e-mail]

   University of Cambridge Computer Lab:
      email -- [e-mail]

   University of Colorado:
      ftp   --  ftp.cs.colorado.edu:/pub/cs/techreports

   University of Florida:
      ftp   -- bikini.cis.ufl.edu:/cis/tech-reports

   University of Georgia:
      ftp   -- ai.uga.edu:/pub/ai.reports/

   University of Illinois at Urbana:
      ftp   -- a.cs.uiuc.edu:/pub/dcs
      email -- [e-mail]

   University of Indiana, Center for Research on Concepts and Cognition:
      ftp   --  cogsci.indiana.edu:/pub/
      email --  [e-mail]

   University of Kaiserslautern, Germany:
      ftp   --  ftp.uni-kl.de:/reports_uni-kl/computer_science/

   University of Kentucky:
      ftp   --  ftp.ms.uky.edu:/pub/tech-reports/UK/cs/

   University of Massachusetts at Amherst:
      email --  [e-mail]

   University of Melbourne, Australia,
   Computer Vision and Pattern Recognition Laboratory (CVPRL):
      ftp   -- krang.vis.mu.oz.au:/pub/articles

   University of Michigan:
      ftp   -- ftp.eecs.umich.edu:/techreports

   University of North Carolina:
      ftp   -- ftp.cs.unc.edu:/pub/technical-reports/

   University of Pennsylvania:
      ftp   -- ftp.cis.upenn.edu:/pub/papers/
      email -- [e-mail] [email bounced 7/7/93]

   USC/Information Sciences Institute:
      email -- Sheila Coyazo <[e-mail]> is the contact. [email
           bounced 7/7/93]

   University of Toronto:
      ftp   -- ftp.cs.toronto.edu:/pub/cogrob/   (Cognitive Robotics)
           ftp.cs.toronto.edu:/pub/reports/
      email -- [e-mail]

   University of Virginia:
      ftp   -- uvacs.cs.virginia.edu:/pub/techreports/cs

   University of Wisconsin:
      ftp   -- ftp.cs.wisc.edu:/tech-reports
           ftp.cs.wisc.edu:/machine-learning
           ftp.cs.wisc.edu:/computer-vision
      email -- [e-mail]


Some AI authors have set up repositories of their own papers:

   Matthew Ginsberg: t.stanford.edu:/u/ftp/papers

----------------------------------------------------------------
Subject: [6-3] Where can I get a machine readable dictionary, thesaurus, and
               other text corpora?

Free:

   /usr/dict/words

   Roget's 1911 Thesaurus is available by anonymous FTP from the
   Consortium for Lexical Research
      clr.nmsu.edu:/CLR/lexica/roget-1911 [128.123.1.12]
   It is also available from
      src.doc.ic.ac.uk:/literary/collections/project_gutenberg/roget11.txt.Z
   An old Webster's dictionary is in /text/dict/{DICT.Z,DICT.INDEX.Z}.
   Project Gutenberg also has Roget's 1911 Thesaurus. The Project
   Gutenberg archive is at mrcnext.cso.uiuc.edu:/pub/etext/. The
   Project Gutenberg archive collects public domain electronic books. For more
   information, write to Michael S. Hart, Professor of Electronic Text,
   Executive Director of Project Gutenberg Etext, Illinois Benedictine
   College, 5700 College Road, Lisle, IL 60532 or send email to
   [e-mail].

   For people without FTP, Austin Code Works sells floppy disks
   containing Roget's 1911 Thesaurus for $40.00. This money helps support
   the production of other useful texts, such as the 1913 Webster's dictionary.

   The Online Book Initiative maintains a text repository on
   ftp.std.com (a public access UNIX system, 617-739-WRLD). See the
   README file on obi.std.com:/obi/. For more information, send email to
   [e-mail], write to Software Tool & Die, 1330 Beacon Street,
   Brookline, MA 02146, or call 617-739-0202.

   The CHILDES project at Carnegie Mellon University has a lot of data of
   children speaking to adults, as well as the adult written and adult
   spoken corpora from the CORNELL project.  Contact Brian MacWhinney
   <[e-mail]> for more information.

   The Association for Computational Linguistics (ACL) has a Data
   Collection Initiative. For more information, contact Donald Walker at
   Bellcore, [e-mail].

   Two lists of common female first names (4967 names) and male first
   names (2924 names) are available for anonymous ftp from
      ftp.cs.cmu.edu:/user/ai/areas/nlp/corpora/names/
   Read the file README first. Send mail to [e-mail] for more
   information.

   A list of 110,000 English words (one per line, in ASCII) is
   available in the PD1:<MSDOS.LINGUISTICS> directory on SIMTEL20 as the
   files WORDS1.ZIP, WORDS2.ZIP, WORDS3.ZIP, and WORDS4.ZIP. Although the
   list is in MS-DOS files, it can easily be used on other machines (but
   first you'll have to unzip the files on a DOS machine). The list
   includes inflected forms of the words, such as plural nouns and the
   -s, -ed, and -ing forms of verbs; thus the number of lexical stems in
   the list is considerably smaller than the total number of word forms.
   These files are available via FTP from WSMR-SIMTEL20.ARMY.MIL
   [192.88.110.20].  SIMTEL20 files are mirrored on wuarchive.wustl.edu.

   The Collins English Dictionary encoded as a Prolog fact base is
   available from the Oxford Text Archive by anonymous ftp from
      black.ox.ac.uk:/ota/dicts/1192/  [129.67.1.165]
   The Oxford Text Archive includes many other texts, dictionaries,
   thesauri, word lists, and so on, most of which are available for
   scholarly use and research only. See the files
      black.ox.ac.uk:/ota/textarchive.form
      black.ox.ac.uk:/ota/textarchive.info
      black.ox.ac.uk:/ota/textarchive.list
      black.ox.ac.uk:/ota/textarchive.sgml
   for more information, or write to [e-mail], Oxford Text Archive,
   Oxford University Computing Services, 13 Banbury Road, Oxford OX2
   6NN, UK, call 44-865-273238 or fax [phone].

   Chuck Wooters <[e-mail]> has extracted the most
   likely pronunciation for each of about 6100 words in the hand-labeled
   TIMIT database, and made them available by anonymous ftp from
   ftp.icsi.berkeley.edu:/pub/speech/TIMIT.mostlikely.Z.

   A list of homophones from general American English is available by
   anonymous ftp from svr-ftp.eng.cam.ac.uk:/comp.speech/data/ as the file
   homophones-1.01.txt. To receive the list by email, send mail to
   [e-mail]. The list was compiled by Tony Robinson.

   Sigurd P. Crossland <[e-mail]> has been compiling
   a dictionary of English words, including most common American words,
   abbreviations, hyphenations, and even incorrect spellings. The most
   recent version is available by anonymous ftp from
      wocket.vantage.gte.com:/pub/standard_dictionary/dic-0394.tar.gz
   The tar file includes 31 text files, one for each word-length from 2
   to 32. The compressed tar file takes up just over 4mb of space, and
   includes approximately 870,000 words.

   WordNet is an English lexical reference system based on current
   psycholinguistic theories of human lexical memory. It organizes nouns,
   verbs and adjectives into synonym sets corresponding to lexical
   concepts. The sets are linked by a variety of relations. Besides being
   of scientific interest,
   it makes a handy thesaurus. WordNet is available by anonymous ftp from
      clarity.princeton.edu:/pub/
   If you retrieve a copy of wordnet by ftp, please send mail to
   [e-mail].

Commercial:

   Illumind publishes the Moby Thesaurus (25,000 roots/1.2 million
   synonyms), Moby Words (560,000 entries), Moby Hyphenator (155,000
   entries), and the Moby Part-of-Speech (214,000 entries), Moby
   Pronunciator (167,000 entries with IPA encoding, syllabification, and
   primary, secondary, and tertiary stress marks) and Moby Language
   (100,000 word word lists in five major world languages) lexical
   databases. All databases are supplied in pure ASCII, royalty-free, in
   both Macintosh and MS-DOS disk formats (also in .Z file formats). Both
   commercial (to resell derived structures as part of commercial
   applications) and educational/research licenses are available. Samples
   of each of the lexical databases are available by anonymous ftp from
   netcom.com:/pub/grady/Moby_Sampler.tar.Z [192.100.81.100].  For more
   information, write to Illumind, Attn: Grady Ward, 3449 Martha Court,
   Arcata, CA 95521, call/fax [phone], or send email to
   [e-mail].

   The Oxford Text Archive has hundreds of online texts in a wide variety
   of languages, including a few dictionaries (the OED, Collins, etc.).
   The Lancaster-Oslo-Bergen (LOB), Brown, and London-Lund corpii are also
   available from them.  For more information, write to Oxford Electronic
   Publishing, Oxford University Press, 200 Madison Avenue, New York, NY
   10016, call 212-889-0206, or send mail to [e-mail].
   (Their contact information in England is Oxford Text Archive, Oxford
   University Computing Service, 13 Banbury Road, Oxford OX2 6NN, UK, +44
   (865) 273238.)

Mailing Lists:

   CORPORA is a mailing list for Text Corpora. It welcomes information
   and questions about text corpora such as availability, aspects of
   compiling and using corpora, software, tagging, parsing, and
   bibliography. To be added to the list, send a message to
   [e-mail]. Contributions should be sent to
   [e-mail].

Linguistic Data Consortium:

   The Linguistic Data Consortium was established to broaden the collection
   and distribution of speech and natural language data bases for the
   purposes of research and technology development in automatic speech
   recognition, natural language processing, and other areas where large
   amounts of linguistic data are needed.  Information about the LDC is
   available by anonymous ftp from ftp.cis.upenn.edu:/pub/ldc [130.91.6.8].
   Documents available in this directory include a paper on the background,
   rationale and goals of the LDC, a brief list of available data bases,
   and some tables summarizing these corpora. For further information,
   contact Elizabeth Hodas, <[e-mail]>, Mark Liberman
   <[e-mail]>, or Jack Godfrey <[e-mail]>.

----------------------------------------------------------------
Subject: [6-4] List of Smalltalk implementations.

   Little Smalltalk -- Tim Budd's version of Smalltalk
   cs.orst.edu:/pub/budd/small.v3.tar

   GNU Smalltalk
   prep.ai.mit.edu:/pub/gnu/smalltalk-1.1.1.tar.Z

----------------------------------------------------------------
Subject: [6-5] AI-related CD-ROMs

   The NCC Artificial Intelligence CD-ROM (Revision 2, 1993) is available
   from Network Cybernetics Corporation for $129.00 per copy (plus $5
   shipping domestic, $10 shipping international). If you currently own
   the first edition of the AI CD-ROM, you can "upgrade" to the Rev.2 CD
   for $79 + shipping.  The AI CD-ROM is an ISO-9660 format disk usable
   on any computer system, and contain a variety of public domain,
   shareware, and other software of special interest to the AI community.
   The disk contains source code, executable programs, demonstration
   versions of commercial programs, tutorials and other files for a
   variety of operating systems. Among the supported operating systems
   are MS-DOS, OS/2, Mac, Amiga, and Unix. Among the items included are
   CLIPS v6.0 and NETS, courtesy of COSMIC, the collected source code
   from AIExpert magazine from the premier issue in June of 1986 to the
   present, and complete transcriptions of the first annual Loebner Prize
   competition, which took place at the Boston Computer Museum. It also
   includes examples many different kinds of neural networks, genetic
   algorithms, artificial life simulators, natural language software,
   public domain and shareware compilers for a wide range of languages
   such as Lisp, Xlisp, Scheme, XScheme, Smalltalk, Prolog, ICON, SNOBOL,
   and many others. Complete collections of the Neural Digest, Genetic
   Algorithms Digest, and Vision List Digest are included. All files on
   the disk are compressed in ZIP format. Network Cybernetics Corporation
   intends to release annual revisions to the AI CD-ROM to keep it up to
   date with current developments in the field. For more information,
   write to Network Cybernetics Corporation, 4201 Wingren Road, Suite
   202, Irving, Texas 75062-2763, call 214-650-2002, fax [phone], or
   send email to [e-mail] or [e-mail] (Steve
   Rainwater).

   PTF is a semi-annual CD-ROM collection of UNIX-related freeware source
   code and documentation. PTF in no way modifies the legal restrictions
   on any package it includes. Each issue consists of two ISO-9660
   CD-ROMs, bound into a 50+ page booklet. PTF is particularly useful for
   programmers who do not have FTP access, but may also be useful as a
   way of saving disk space and avoiding annoying FTP searches and
   retrievals. The current issue (2-1; January, 1993) includes, among
   other things, ICOT collection and several varieties of Lisp and other
   AI languages. It sells (list) for $60 US plus applicable sales tax and
   shipping and handling charges. SUG and USENIX members may purchase the
   issue for $50. Payable through Visa, Mastercard, postal money orders
   in US funds, and checks in US funds drawn on a US bank. For more
   information write to Prime Time Freeware, 370 Altair Way, Suite 150,
   Sunnyvale, CA 94086 call 408-433-9662, fax [phone], or send email
   to [e-mail].
----------------------------------------------------------------
Subject: [6-6] World-Wide Web (WWW) Resources

The World Wide Web (WWW) is a hypermedia document that spans the
Internet.  It uses the http (HyperText Transfer Protocol) for the
light-weight exchange of files over the Internet.  NCSA Mosaic is a
World Wide Web browser developed at the National Center for
Supercomputing Applications (NCSA).

Mosaic's popularity derives, in part, from its ability to communicate
using more traditional Internet protocols like FTP, Gopher, WAIS, and
NNTP, in addition to http. Mosaic can display text, hypertext links,
and inlined graphics directly. When Mosaic encounters a file type it
can't handle internally, such as Postscript documents, mpeg movies,
sound files, and JPEG images, it uses an external viewer (or player)
like Ghostscript to handle the file. Mosaic also includes facilities
for exploring the Internet. In other words, Mosaic is an multimedia
interface to the Internet.

The hypertext documents viewed with Mosaic are written in HTML
(HyperText Markup Language), which is a subset of SGML (Standard
Generalized Markup Language).  All that is needed is just a few more
improvements, such as the ability to format tables and mathematics,
and a WYSIWYG editor, for HTML to greatly facilitate electronic
journals and other publications.

NCSA Mosaic for the X Window System is available by anonymous ftp from
   ftp.ncsa.uiuc.edu:/Mosaic/
as source code and binaries for Sun, SGI, IBM RS/6000, DEC Alpha OSF/1, DEC
Ultrix, and HP-UX. Questions about NCSA Mosaic should be directed to
[e-mail] (X-Windows version), [e-mail]
(Macintosh), and [e-mail] (Microsoft Windows).

The remainder of this section lists WWW resources of interest to AI
researchers, students, and practitioners.

AI-related FAQ Postings:

   A simple HTML version of the AI FAQ (this FAQ) and several other
   AI-related FAQs is available as
      http://www.cs.cmu.edu:8001/Web/Groups/AI/html/faqs/top.html
   or equivalently,
      http://www.cs.cmu.edu:8001/afs/cs/project/ai-repository/ai/html/faqs/top.html
   It is prepared automatically from the original once a week and
   ftp sites, gopher, and other WWW references in the text are
   automatically converted to http references.

Artificial Life:

   http://alife.santafe.edu/

ACM SIGART:

   The Association for Computing Machinery's Special Interest Group
   for AI's gopher server is
       gopher://sigart.acm.org:70/
   The WWW URL is
       http://sigart.acm.org/
   Also available by FTP and Telnet (login eis).

Data Mining and Knowledge Discovery in Databases:

   http://www.cs.bham.ac.uk/~anp/TheDataMine.html

Genetic Art and Movies:

   Programs which use genetic algorithms to create art, inspired by the
   work of Karl Sims at Thinking Machines. Votes from human users (folks
   like you) are used to determine the "fitness" of the pictures in the
   current generation. The more fit pictures are more likely to be used
   in the creation of the next generation. After about a dozen or so
   generations, really pretty pictures result.

   Interactive Genetic Art II
      http://mixing.sp.cs.cmu.edu:8001/htbin/mjwgenform

   Interactive Genetic Movies
      http://mixing.sp.cs.cmu.edu:8001/htbin/moviegenform

Machine Learning:

   The Knowledge Systems Laboratory of the National Research Council of
   Canada has set up a WWW server for AI, with an emphasis on machine
   learning. The URL for the server is
      http://ai.iit.nrc.ca/home_page.html
   For more information, write to Peter Turney <[e-mail]>.

Neural Networks:

   http://www.eeb.ele.tue.nl/index.html

   http://www.cosy.sbg.ac.at/~rschwaig/rschwaig/projects.html

Robotics:

   A list of pointers to sources of robotics information on the Internet.
      http://cs.indiana.edu/robotics/world.html
   Includes a HTML version of the comp.robotics FAQ,
      http://cs.indiana.edu/robotics/copy.html
   maintained by Jason Almeter <[e-mail]>.

   The Grad Students Who's Who in Robotics:
      http://www.sm.luth.se/csee/ra/sm-roa/RoboticsJump.html
      http://www.sm.luth.se/csee/ra/sm-roa/Robotics/WhoSWho.html

Computer Vision:

   http://www.cs.cmu.edu:8001/afs/cs/project/cil/ftp/html/vision.html

Various Universities:

   These Mosaic/WWW pages typically contain information about research
   projects, on-line technical reports, lists of faculty and students,
   and other relevant information pertaining to the university.

   CIRL                 http://wrigley.uoregon.edu/
   CMU SCS              http://www.cs.cmu.edu:8001/Web/FrontDoor.html
   GATech AI            http://www.gatech.edu/ai/ai.html
   GATech CogSci        http://www.gatech.edu/cogsci/cogsci.html
   JAIR            gopher://p.gp.cs.cmu.edu/
   MIT AI Lab        http://www.ai.mit.edu/
   Stanford KSL        http://www-ksl.stanford.edu/
   U. of Washington AI  http://www.cs.washington.edu/research/projects/ai/www/
   UMass DAI Lab    http://dis.cs.umass.edu/
   UMass Robotics       http://piglet.cs.umass.edu:4321/lpr.html

   UPenn IRCS:         http://www.cis.upenn.edu/~ircs/homepage.html
      (NSF Institute for Research in Cognitive Science)

   Institute for Language Technology and AI:
      http://itkwww.kub.nl:2080:/itk/itkhome.html

   University of Leeds Speech Laboratory:
      URL: http://lethe.leeds.ac.uk/
      Provides access to the MAchine Readable Spoken English Corpus
      (MARSEC) data via anonymous ftp and a bulletin board for users
      of the corpus.

   Pacific Northwest Laboratory: (Neural Networks)
      http://www.msrc.pnl.gov:2080/docs/cie/neural/neural.homepage.html

   CMU Oz Project:
      http://www.cs.cmu.edu:8001/afs/cs.cmu.edu/project/oz/web/oz.html

      Some of the project's papers are also accessible as
         ftp.cs.cmu.edu:/afs/cs.cmu.edu/project/oz/ftp/papers/
      Please read the copyright information in that directory before
      grabbing any papers.

   Glasgow and Strathclyde Universities BUBL: Artificial Intelligence
   gopher://ukoln.bath.ac.uk:7070/1/Link/Tree/Computing/Artificial_Intelligence

----------------------------------------------------------------
;;; *EOF*